package puzzle.projecteuler.p100;

import astudy.util.AdvMath;


public class Problem010 {

	public static void main(String[] args) {

		long s = 0;
		for (long i = 1; i < 2000000; i ++) {
			if (AdvMath.isPrime(i)) {
				s += i;
			}
		}
		System.out.println(s);
	}
}
